Cuckoo search via Lévy flights for the capacitated vehicle routing problem
نویسندگان
چکیده
منابع مشابه
Cuckoo search via Lévy flights for the capacitated vehicle routing problem
For this paper, we explored the implementation of the cuckoo search algorithm applied to the capacitated vehicle routing problem. The cuckoo search algorithm was implemented with Lévy flights with the 2-opt and double-bridge operations, and with 500 iterations for each run. The algorithm was tested on the problem instances from the Augerat benchmark dataset. The algorithm did not perform well o...
متن کاملCuckoo Search Algorithm for Capacitated Vehicle Routing Problem
The cuckoo search algorithm is a novel metaheuristic based on the reproduction behavior of some cuckoo species in combination with the Lévy flight behavior of some birds and fruit flies. It has been applied to a wide range of optimization problems with good performance such as a TSP; nonetheless, it has yet to be applied to the vehicle routing problem, specifically the capacitated vehicle routi...
متن کاملAn Improved Hybrid Cuckoo Search Algorithm for Vehicle Routing Problem with Time Windows
Transportation in economic systems such as services, production and distribution enjoys a special and important position and provides a significant portion of the country's gross domestic product. Improvements in transportation system mean improvements in the traveling routes and the elimination of unnecessary distances in any system. The Vehicle Routing Problem (VRP) is one of the practical co...
متن کاملCuckoo search via Levy flights applied to uncapacitated facility location problem
Facility location problem (FLP) is a mathematical way to optimally locate facilities within a set of candidates to satisfy the requirements of a given set of clients. This study addressed the uncapacitated FLP as it assures that the capacity of every selected facility is finite. Thus, even if the demand is not known, which often is the case, in reality, organizations may still be able to take s...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Industrial Engineering International
سال: 2017
ISSN: 1735-5702,2251-712X
DOI: 10.1007/s40092-017-0227-5